Stochastic Categorial Grammars
نویسندگان
چکیده
Statistical methods have turned out to be quite successful in natural language processing. During the recent years, several models of stochastic grammars have been proposed, including models based on lexicalised context-free grammars [3], tree adjoining grammars [15], or dependency grammars [2, 5]. In this exploratory paper, we propose a new model of stochastic grammar, whose originality derives from being based on Lambek categorial grammars [8]. This model presents interesting properties:
منابع مشابه
Learning Stochastic Categorial Grammars
Stochastic categorial grammars (SCGs) are introduced as a more appropriate formalism for statistical language learners to est imate than stochastic context free grammars. As a vehicle for demonstrating SCG estimation, we show, in terms of crossing rates and in coverage, that when training material is limited, SCG estimation using the Minimum Description Length Principle is preferable to SCG est...
متن کاملExploiting auxiliary distributions in stochastic uni cation-based grammars
This paper describes a method for estimating conditional probability distributions over the parses of \uniication-based" grammars which can utilize auxiliary distributions that are estimated by other means. We show how this can be used to incorporate information about lexical selectional preferences gathered from other sources into Stochastic \Uniication-based" Grammars (SUBGs). While we apply ...
متن کاملExploiting auxiliary distributions in stochastic uni
This paper describes a method for estimating conditional probability distributions over the parses of uniication-basedd grammars which can utilize auxiliary distributions that are estimated by other means. We show how this can be used to incorporate information about lexical selectional preferences gathered from other sources into Stochastic Uniication-basedd Grammars (SUBGs). While we apply th...
متن کاملSyntactic categories and types: Ajdukiewicz and modern categorial grammars
This essay confronts Ajdukiewicz’s approach to syntactic categories with modern categorial grammars, mainly AB-grammars (basic categorial grammars) and Lambek grammars, i.e. categorial grammars based on different versions of the Lambek calculus.
متن کاملRigid Lambek Grammars Are Not Learnable from Strings
This paper is concerned with learning categorial grammars in Gold's model (Gold, 1967). Recently, learning algorithms in this model have been proposed for some particular classes of classical categorial grammars (Kanazawa, 1998). We show that in contrast to classical categorial grammars, rigid and k-valued Lambek grammars are not learnable from strings. This result holds for several variants of...
متن کامل